Resource Allocation for Outdoor-to-Indoor Multicarrier Transmission with Shared UE-side Distributed Antenna Systems

In this paper, we study the resource allocation algorithm design for downlink multicarrier transmission with a shared user equipment (UE)-side distributed antenna system (SUDAS) which utilizes both licensed and unlicensed frequency bands for improving the system throughput. The joint UE selection and transceiver processing matrix design is formulated as a non-convex optimization problem for the maximization of the end-to-end system throughput (bits/s). In order to obtain a tractable resource allocation algorithm, we first show that the optimal transmitter precoding and receiver post-processing matrices jointly diagonalize the end-to-end communication channel. Subsequently, the optimization problem is converted to a scalar optimization problem for multiple parallel channels, which is solved by using an asymptotically optimal iterative algorithm. Simulation results illustrate that the proposed resource allocation algorithm for the SUDAS achieves an excellent system performance and provides a spatial multiplexing gain for single-antenna UEs.Comment: accepted for publication at the IEEE Vehicular Technology Conference (VTC) Spring, Glasgow, Scotland, UK, May 201

A Low-Power RRAM Memory Block for Embedded, Multi-Level Weight and Bias Storage in Artificial Neural Networks

Pattern recognition as a computing task is very well suited for machine learning algorithms utilizing artificial neural networks (ANNs). Computing systems using ANNs usually require some sort of data storage to store the weights and bias values for the processing elements of the individual neurons. This paper introduces a memory block using resistive memory cells (RRAM) to realize this weight and bias storage in an embedded and distributed way while also offering programming and multi-level ability. By implementing power gating, overall power consumption is decreased significantly without data loss by taking advantage of the non-volatility of the RRAM technology. Due to the versatility of the peripheral circuitry, the presented memory concept can be adapted to different applications and RRAM technologies

BREILING: LOGARITHMIC UPPER BOUND..., SUBMITTED TO THE IEEE TRANS. ON IT, 11/04/2001 1 A Logarithmic Upper Bound on the Minimum Distance of Turbo Codes

We derive new upper bounds on the minimum distance, which Turbo codes can max-imally attain with the optimum interleaver of a given length. The new bounds grow approximately logarithmically with the interleaver length, and they are tighter than all previously derived bounds for medium-length and long interleavers. An extensive discus-sion highlights the impacts of the new bounds in the context of interleaver design and provides some new design guidelines. The author would like to thank the Fraunhofer Gesellschaft — Institut für Integrierte Schaltungen, Erlangen, for supporting this work

Upper bound on the minimum distance of turbo codes

Abstract—We derive new upper bounds on the minimum distance, which turbo codes can maximally attain with the optimum interleaver of a given length. The new bounds grow approximately logarithmically with the interleaver length, and they are tighter than all previously derived bounds for medium-length and long interleavers. An extensive discussion highlights the impacts of the new bounds in the context of interleaver design and provides some new design guidelines. Index Terms—Interleaver design, minimum-distance bounds, turbo code. I

Combinatorial Analysis of the Minimum Distance of Turbo Codes

In this paper, new upper bounds on the maximum attainable minimum Hamming distance of Turbo codes with arbitrary | including the best | interleavers are established using a combinatorial approach. These upper bounds depend on the interleaver length, on the code rate and on the scramblers employed in the encoder. Examples of the new bounds for particular Turbo codes are given and discussed. The new bounds are tighter than all existing ones and prove that the minimum Hamming distance of Turbo codes cannot asymptotically grow at a rate more than the third root of the codeword length. Keywords: Turbo code, minimum Hamming distance bounds, interleaver design The authors would like to thank the Fraunhofer Gesellschaft { Institut f\u7fur Integrierte Schaltungen, Erlangen, for supporting this work. June 25, 2001 DRAFT BREILING, HUBER: COMBINATORIAL ANALYSIS ...; SUBMITTED TO THE IEEE TRANS. ON IT 06/03/2000 2 I